An Efficient Algorithm for Reliability Upper Bound of Distributed Systems with Unreliable Nodes
نویسندگان
چکیده
The reliability of distributed systems in which the communication links are considered reliable while the computing nodes may fail with certain probabilities have been modeled by a probabilistic network or a graph G. Computing the residual connectedness reliability (RCR), denoted by R(G), of probabilistic networks with unreliable nodes is very useful, but is an NP-hard problem. To derive the exact R(G) expressions for large networks can become rather complex. As network size increases, the reliability bounds could be used to estimate the reliability of the networks. In this paper, we present an efficient algorithm for computing the reliability upper bound of distributed systems with unreliable nodes. We also apply our algorithm to some typical classes of graphs in order to evaluate the upper bound and show the effectiveness and the efficiency of the new algorithm. Numerical results are presented. Keywordsdistributed systems; residual connectedness reliability; probabilistic network; upper bound
منابع مشابه
An Efficient Evaluation for the Reliability Upper Bound of Distributed Systems with Unreliable Nodes and Edges
The distributed systems in which nodes and/or edges may fail with certain probabilities have been modelled by a probabilistic network or a graph G. Computing the residual connectedness reliability (RCR), denoted by R(G), of probabilistic networks under the fault model with both node and edge faults is very useful, but is an NP-hard problem. Since it may need exponential time of the network size...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملDistributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements
Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...
متن کاملAn Efficient Algorithm for Reliability Lower Bound of Distributed Systems
The reliability of distributed systems and computer networks have been modeled by a probabilistic network or a graph G. Computing the residual connectedness reliability (RCR), denoted by R(G), under the node fault model is very useful, but is an NP−hard problem. Since it may need exponential time of the network size to compute the exact value of R(G), it is important to calculate its tight appr...
متن کاملEstimation of Network Reliability for a Fully Connected Network with Unreliable Nodes and Unreliable Edges using Neuro Optimization
In this paper it is tried to estimate the reliability of a fully connected network of some unreliable nodes and unreliable connections (edges) between them. The proliferation of electronic messaging has been witnessed during the last few years. The acute problem of node failure and connection failure is frequently encountered in communication through various types of networks. We know that a ne...
متن کامل